Write an algorithm to determine if a number is "happy".
A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.
Input: 19 Output: true Explanation: 12 + 92 = 82 82 + 22 = 68 62 + 82 = 100 12 + 02 + 02 = 1
# @param {Integer} n# @return {Boolean}defis_happy(n)set=Set.newwhile not set.include?(n)set.add(n)new_n=0whilen > 0new_n += (n % 10) ** 2n /= 10endn=new_nendreturnn == 1enduse std::collections::HashSet;implSolution{pubfnis_happy(n:i32) -> bool{letmut set = HashSet::new();letmut n = n;letmut new_n:i32;while !set.contains(&n){ set.insert(n); new_n = 0;while n > 0{ new_n += (n % 10).pow(2); n /= 10;} n = new_n;} n == 1}}